# -*- coding: UTF-8 -*-
from typing import List

from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def generateParenthesis(self, n: int) -> List[str]:
        # 递归函数
        def process(result_list: List[str], curr_str, left_count, right_count, total):
            # 判断是否完成组合
            if left_count == right_count == total:
                result_list.append(curr_str)
                return
            # 判断是否为错误的组合
            if right_count > left_count:
                return

            # 进行下一个括号的选择
            if left_count < total:
                process(result_list, curr_str + '(', left_count + 1, right_count, total)

            if right_count < total:
                process(result_list, curr_str + ')', left_count, right_count + 1, total)

        result = []
        process(result, '', 0, 0, n)
        return result


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (3, ["((()))", "(()())", "(())()", "()(())", "()()()"]),
        (1, ["()"])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.generateParenthesis(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

